Use of Büchi automata and randomness for the description of biological processes

نویسندگان

  • Konstantinos Giannakis
  • Theodore
چکیده

The main topic of this study is the modelling and verification of biological systems using ω-automata. This work focuses on the protein folding problem and the infinite behaviour it features in many cases. Specifically, stochastic computational models with infinite input are used in this paper’s approach and indicative aspects of a biological problem are presented using both ω-automata and probabilistic Büchi automata (PBAs), making a novel attempt to establish their use in reasoning about biological processes. Necessary preliminary definitions and background towards this direction are provided. Finally, the pros and cons of each model are shown through examples. Overall, this work contributes by combining for the very first time PBAs with real biological mechanisms, with indicative examples, both with PBAs and NBAs (non-deterministic Büchi automata).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING

In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...

متن کامل

Efficient Translation from Transition-Based Generalized Büchi Automata to Büchi Automata

The automata-theoretic approach is one of the state-of-the-art model-checking methods, which consists of the following steps: use a Büchi automaton to represent the abstract system model; use an LTL formula to express the properties to be verified; translate the negation of the LTL formula to a Büchi automaton and check whether the intersection of sentences accepted by the two automata is non-e...

متن کامل

Simulation of Future Land Use Map of the Catchment Area, with the Integration of Cellular Automata and Markov Chain Models Based on Selection of the Best Classification Algorithm: A Case Study of Fakhrabad Basin of Mehriz, Yazd

INTRODUCTION Since the land use change affects many natural processes including soil erosion and sediment yield, floods and soil degradation and the chemical and physical properties of soil, so, different aspects of land use changes in the past and future should be considered particularly in the planning and decision-making. One of the most important applications of remote sensing is land ...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Utilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs

Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015